Computing real roots of real polynomials
نویسندگان
چکیده
منابع مشابه
Computing real roots of real polynomials
Computing the roots of a univariate polynomial is a fundamental and long-studied problem of computational algebra with applications in mathematics, engineering, computer science, and the natural sciences. For isolating as well as for approximating all complex roots, the best algorithm known is based on an almost optimal method for approximate polynomial factorization, introduced by Pan in 2002....
متن کاملEfficiently Computing Real Roots of Sparse Polynomials
We propose an efficient algorithm to compute the real roots of a sparse polynomial f ∈ R[x] having k non-zero realvalued coefficients. It is assumed that arbitrarily good approximations of the non-zero coefficients are given by means of a coefficient oracle. For a given positive integer L, our algorithm returns disjoint disks ∆1, . . . ,∆s ⊂ C, with s < 2k, centered at the real axis and of radi...
متن کاملOn Bounds for Real Roots of Polynomials
The computation of the real roots of univariate polynomials with real coefficients is done using several algorithmic devices. Many of them are based on the isolation of the real roots, i.e. the computation of a finite number of intervals with the property that each of them contains exactly one root. For that one of the steps is that of computing bounds for the roots. This can be realized using ...
متن کاملReal Roots of Quadratic Interval Polynomials
The aim of this paper is to study the roots of interval polynomials. The characterization of such roots is given and an algorithm is developed for computing the interval roots of quadratic polynomials with interval coefficients. Mathematics Subject Classification: 65G40
متن کاملInequalities on real roots of polynomials
We survey the most used bounds for positive roots of polynomials and discuss their efficiency. We obtain new inequalities on roots of polynomials. Then we give new inequalities on roots of orthogonal polynomials, obtained from the differential equations satisfied by these polynomials. Mathematics subject classification (2000): 12D10, 68W30.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2016
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2015.03.004